An Improved Reptile Search Algorithm with Ghost Opposition-Based Learning for Global Optimization Problems

نویسندگان

چکیده

Abstract In 2021, a meta-heuristic algorithm, Reptile Search Algorithm (RSA), was proposed. RSA mainly simulates the cooperative predatory behavior of crocodiles. Although has fast convergence speed, due to influence crocodile predation mechanism, if algorithm falls into local optimum in early stage, will probably be unable jump out optimum, resulting poor comprehensive performance. Because shortcomings RSA, introducing escape operator can effectively improve crocodiles' ability explore space and generate new crocodiles replace Benefiting from adding restart strategy, when optimal solution is no longer updated, algorithm's improved by randomly initializing crocodile. Then joining Ghost opposition-based learning balance IRSA's exploitation exploration, Improved with Opposition-based Learning for Global Optimization Problem (IRSA) To verify performance IRSA, we used nine famous optimization algorithms compare IRSA twenty-three standard benchmark functions CEC2020 test functions. The experiments show that good robustness, solve six classical engineering problems, thus proving its effectiveness solving practical problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

Improved Cuckoo Search Algorithm for Global Optimization

The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...

متن کامل

improved cuckoo search algorithm for global optimization

the cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. to enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. normally, the parametersof the cuckoo search are kept constant. this may lead todecreasing the efficiency of the algorithm. to cop...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

An Improved Cat Swarm Optimization Algorithm Based on Opposition-Based Learning and Cauchy Operator for Clustering

Clustering is a NP-hard problem that is used to find the relationship between patterns in a given set of patterns. It is an unsupervised technique that is applied to obtain the optimal cluster centers, especially in partitioned based clustering algorithms. On the other hand, cat swarm optimization (CSO) is a new metaheuristic algorithm that has been applied to solve various optimization problem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Design and Engineering

سال: 2023

ISSN: ['2288-5048', '2288-4300']

DOI: https://doi.org/10.1093/jcde/qwad048